Optimal Stable Merging
نویسندگان
چکیده
منابع مشابه
Optimal Stable Merging
This paper shows how to stably merge two sequences A and B of sizes m and n, m n, respectively, with O m n assignments, O m log n=m 1 comparisons and using only a constant amount of additional space. This result matches all known lower bounds and closes an open problem posed by Dudzinski and Dydek in 1981. Our algorithm is based on the unstable algorithm of Mannila and Ukkonen. All techn...
متن کاملSimplified, stable parallel merging
This note makes an observation that significantly simplifies previous parallel, two-way merge algorithms based on binary search and sequential merge in parallel. First, it is shown that the additional merge step of distinguished elements as found in previous algorithms is not necessary , thus simplifying the implementation and reducing constant factors. Second, by fixating the requirements to t...
متن کاملOn Optimal Merging Networks
Kazuyuki Amano? and Akira Maruoka Graduate S hool of Information S ien es, Tohoku University Aoba 05, Aramaki, Sendai 980-8579 JAPAN fama|maruokag e ei.tohoku.a .jp Tel:+81-22-217-7149, Fax:+81-22-263-9414 Abstra t. We prove that Bat her's odd-even (m;n)-merging networks are exa tly optimal for (m;n) = (3; 4k + 2) and (4; 4k + 2) for k 0 in terms of the number of omparators used. For other ases...
متن کاملOptimal State Merging without Decoupling
We construct an optimal state merging protocol by adapting a recently-discovered optimal entanglement distillation protcol [Renes and Boileau, Phys. Rev. A. 73, 032335 (2008)]. The proof of optimality relies only on directly establishing sufficient “amplitude” and “phase” correlations between Alice and Bob and not on usual techniques of decoupling Alice from the environment. This strengthens th...
متن کاملRatio Based Stable In-Place Merging
We investigate the problem of stable in-place merging from a ratio k = n m based point of view where m, n are the sizes of the input sequences with m ≤ n . We introduce a novel algorithm for this problem that is asymptotically optimal regarding the number of assignments as well as comparisons. Our algorithm uses knowledge about the ratio of the input sizes to gain optimality and does not stay i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1995
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/38.8.681